Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Dynamic cloud data audit model based on nest Merkle Hash tree block chain
ZHOU Jian, JIN Yu, HE Heng, LI Peng
Journal of Computer Applications    2019, 39 (12): 3575-3583.   DOI: 10.11772/j.issn.1001-9081.2019040764
Abstract620)      PDF (1372KB)(304)       Save
Cloud storage is popular to users for its high scalability, high reliability, and low-cost data management. However, it is an important security problem to safeguard the cloud data integrity. Currently, providing public auditing services based on semi-trusted third party is the most popular and effective cloud data integrity audit scheme, but there are still some shortcomings such as single point of failure, computing power bottlenecks, and low efficient positioning of erroneous data. Aiming at these defects, a dynamic cloud data audit model based on block chain was proposed. Firstly, distributed network and consensus algorithm were used to establish a block chain audit network with multiple audit entities to solve the problems of single point of failure and computing power bottlenecks. Then, on the guarantee of the reliability of block chain, chameleon Hash algorithm and nest Merkle Hash Tree (MHT) structure were introduced to realize the dynamic operation of cloud data tags in block chain. Finally, by using nest MHT structure and auxiliary path information, the efficiency of erroneous data positioning was increased when error occurring in audit procedure. The experimental results show that compared with the semi-trusted third-party cloud data dynamic audit scheme, the proposed model significantly improves the audit efficiency, reduces the data dynamic operation time cost and increases the erroneous data positioning efficiency.
Reference | Related Articles | Metrics
Delay tolerant network clustering routing algorithm based on vehicular Ad Hoc network communication terminals and motion information
HE He, LI Linlin, LU Yunfei
Journal of Computer Applications    2018, 38 (3): 734-740.   DOI: 10.11772/j.issn.1001-9081.2017071647
Abstract436)      PDF (1142KB)(424)       Save
For complex battlefield environment is lack of stable end-to-end communication path between user terminals, a Delay Tolerant Network (DTN) clustering routing algorithm based on Vehicular Ad Hoc NETwork (VANET) communication terminals and motion information named CVCTM (Cluster based on VANET Communication Terminals and Motion information) was proposed. Firstly, the clustering algorithm based on cluster head election was studied; secondly, the routing algorithm for intra-cluster source vehicle was studied based on hop count, relay mode and geographical location information. Then, the routing algorithm for inter-cluster source vehicle was realized by introducing waiting time, threshold of retransmission times and downstream cluster heads. Finally, the optimal way of communicating with upper headquarter was chosen by VANET communication terminals. The ONE simulation results show that the message delivery ratio of CVCTM increased nearly 5%, the network overhead of it decreased nearly 10%, the recombination times of cluster structure decreased nearly 25% in the comparison with AODV (Ad Hoc On-demand Distance Vector routing); the message delivery ratio of CVCTM increased nearly 10%, the network overhead of it decreased nearly 25%, the recombination times of cluster structure decreased nearly 40% in the comparison with CBRP (Cluster Based Routing Protocal) algorithm and DSR (Dynamic Source Routing) protocal. CVCTM can effectively reduce network overhead and recombination times of cluster structure and increase message delivery ratio.
Reference | Related Articles | Metrics
Scheme of sharing cloud data audit supporting user traceability and lightweight
JIN Yu, CAI Chao, HE Heng
Journal of Computer Applications    2017, 37 (12): 3417-3422.   DOI: 10.11772/j.issn.1001-9081.2017.12.3417
Abstract379)      PDF (996KB)(391)       Save
The data is usually shared by a group of users in cloud computing. The third party auditor can obtain the the identities of group members through their signatures of data blocks. In order to protect the identities of group members, the existing public audit schemes for shared data all hide the identities of group members. However, the anonymity of identity leads to the problem that a member of the group can change the shared data maliciously without being found, and the amount of computation is large for resource constrained devices in the process of generating signature for users. The existing public audit schemes have the problems that the identity of data block can not be traced and the amount of calculation of generating shared data block signature is large. In order to solve the above problems, A Scheme of sharing cloud Data Audit supporting user traceability and lightweight (ASDA) was proposed. Firstly, the security mediator was used to replace the user signature to protect the identities of group members. The information of user was saved while signing and it could be traced back that the data block was modified by which member through the above information, which could ensure the traceability of the identity of data block. Then, a new data block blinding technology was used to reduce the amount of client computing. The experimental results show that, compared with Storing shared Data on the cloud Via Security-mediator (SDVS) scheme, the proposed scheme reduces the computing time of users and realizes the traceability of shared data blocks.
Reference | Related Articles | Metrics